A Survey On Visual Search Reranking

نویسنده

  • Subu Surendran
چکیده

Due to the explosive growth of online video data and images , visual search is becoming an important area of research. Most existing approaches used text based image retrieval which is not so efficient. To precisely specify the visual documents, Visual search reranking is used. Visual search reranking is the rearrangement of visual documents based on initial search results or some external knowledge inorder to make the search efficient. Here we are making a survey of three different reranking methods 1) Reranking via Random walk over document level context graph 2) Reranking via Minimum Incremental Information Loss and 3) Reranking via Pairwise Learning and make a comparative study of it. Keywords—Visual search, Reranking, Context graph, Pairwise learning, Optimization, Mutual information

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning to Rank with Graph Consistency

The ranking models of existing image search engines are generally based on associated text while the image visual content is actually neglected. Imperfect search results frequently appear due to the mismatch between the textual features and the actual image content. Visual reranking, in which visual information is applied to refine text based search results, has been proven to be effective. How...

متن کامل

TUD-MM at MediaEval 2011 Genre Tagging Task: Video search reranking for genre tagging

In this paper, we investigate the possibility of using visual information to improve the text based ranking. Both a structure based representation (using the similarity matrix of the frames of one video) as well as a key-frame based representation (using visual words) is evaluated. It appears that only in some queries the visual information can improve the performance by reranking. The presente...

متن کامل

Rank canonical correlation analysis and its application in visual search reranking

Ranking relevance degree information is widely utilized in the ranking models of information retrieval applications, such as text and multimedia retrieval, question answering, and visual search reranking. However, existing feature dimensionality reduction methods neglect this kind of valuable potential supervised information. In this paper, we extend the pairwise constraints from the traditiona...

متن کامل

Survey on Three Reranking Models for Discriminative Parsing

This survey is inspired by the so-called reranking techniques in natural language processing (NLP). The aim of this survey is to provide an overview of three main reranking tasks particularly for discriminative parsing. We will focus on the motivation for discriminative reranking, on the three models, boosting model, support vector machine (SVM) model and voted perceptron model, on the procedur...

متن کامل

JRS at Search and Hyperlinking of Television Content Task

This paper describes the work done by the JRS team for the linking sub-task. We submitted eight pairs of runs: four with different textual resources only, two using reranking based on visual similarity, and two using concept detection results. Each of the pairs contains of one run using the anchor segment only, and one using a longer context segment. The results show higher variance between anc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013